Rescheduling for Optimized SHA-1 Calculation

نویسندگان

  • Ricardo Chaves
  • Georgi Kuzmanov
  • Leonel Sousa
  • Stamatis Vassiliadis
چکیده

This paper proposes the rescheduling of the SHA-1 hash function operations on hardware implementations. The proposal is mapped on the Xilinx Virtex II Pro technology. The proposed rescheduling allows for a manipulation of the critical path in the SHA-1 function computation, facilitating the implementation of a more parallelized structure without an increase on the required hardware resources. Two cores have been developed, one that uses a constant initialization vector and a second one that allows for different Initialization Vectors (IV ), in order to be used in HMAC and in the processing of fragmented messages. A hybrid implementation is also proposed. Experimental results indicate a throughput of 1.4 Gbits/s requiring only 533 slices for a constant IV and 596 for an imputable IV . Comparisons to SHA-1 related art suggest improvements of the throughput/slice metric of 29% against the most recent commercial cores and 59% to the current academia proposals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Techniques for Hardware Implementations of Sha

Secure Hash Algorithms are one of the forms of cryptographic algorithms. SHA hash functions are widely used security constructs. However, they are software implementations of SHA. This paper proposes techniques for hardware implementation of SHA. In order to provide security and improve performance, these methods are used in hardware reutilization and operation rescheduling. The purpose of impl...

متن کامل

Architectural design features of a programmable high throughput reconfigurable SHA-2 Processor

The continued growth of both wired and wireless communications has triggered the revolution for the generation of new cryptographic algorithms. Hash functions are common and important cryptographic primitives, which are very critical for data integrity assurance and data origin authentication security services. Many hash algorithms have been investigated and developed in the last years. This wo...

متن کامل

Automated Search for Round 1 Differentials for SHA-1: Work in Progress

Wang, Yin and Yu [24] describe a high probability differential path for SHA-1. Since then, various researchers have proposed techniques for improving the speed of finding collisions based on existing differential paths. The speed could be further improved by finding differentials through Round 1 (the first 20 steps) that are optimized to the particular technique. This paper describes progress o...

متن کامل

Advanced SHA-1 Algorithm Ensuring Stronger Data Integrity

SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until recently, SHA-1 was considered to be the most secure hashing algorithm and also remains the most widely used hashing function till date. In this paper, we review various collision search attacks on the original full 80-step SHA-1 algorithm and present a new optimized version of the algorithm that ...

متن کامل

Ant Colony Optimization for the Crew Rescheduling Problem

Disruption management is one of the newest research paths in scheduling problems due to the growing service quality demanded in the transportation field. This paper presents an approach for the rescheduling of crews using an Ant Colony algorithm for costs optimization. The main goal is to find an optimized recovery solution after the occurrence of unexpected events that make the original assign...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006